| 1. | Abstract automata theory
抽象自动机理论 |
| 2. | Automata theory allows practice with formal definitions of computation as it introduces concepts relevant to other nontheoretical areas of computer science
自动控制理论允许执行正式的计算定义，因为它引用了相关的计算机科学的其他非理论方面的概念。 |
| 3. | Existing complexity proofs on the circularity problem of ags are based on automata theory , such as writing pushdown acceptor and alternating turing machines
目前对属性文法循环性问题复杂度的证明，多基于自动机理论，如写入推出接受器、交替涂林机等。 |
| 4. | This paper presents some cellular automata models for traffic flow simulation . firstly , the celluar automata theory was introduced , cellular autoata models quantize complex behavior into simple individual components
本文首先介绍了元胞自动机理论的理论，元胞自动机模型把复杂系统量化为简单的个体。 |
| 5. | Security analyses of a variant of a new block cipher system ( called cac ) based on cellular automata theory are given using two cryptanalytic approaches . the results show that this variant of cac is very insecure under chosen - plaintext attacks
利用两种方法对一个基于细胞自动机的分组密码系统cac的变形进行了分析，结果表明： cac的这种变形在选择明文攻击下是极不安全的。 |
| 6. | The paper formally defines the concept of electronic contract and their goals , obligations , bindings and non - repudiatable proofs by the formal language and automata theory . by making the obligations and proofs work together , the partners are enforced to achieve the business goals
本文用形式语言与自动机理论对电子合同及其目标、责任、约束以及不可抵赖性证据进行形式化定义，使责任和证据相互配合，迫使达到商业目标。 |
| 7. | Automata theory is an important branch of computer science theory . it is widely applied in many fields , such as communication , detection , biology , neurology , psychology , intelligence , economy , and sociology . the research on it is closely related to the development of computer software and hardware
自动机理论是计算机科学中的一个重要组成部分，在通讯、检测、生物、神经、心理、智能、经济和社会等诸多领域都有着广泛应用，其研究与计算机软硬件发展密切相关。 |
| 8. | In multiple - valued logic theory , completeness theory of function sets is an important and fundamental problem , it is also the problem which must be solved in automata theory and multiple - valued logic network . the solution of this problem depends on determining all the precomplete classes in multiple - valued logic function sets
函数系的完备性判定问题是多值逻辑理论中基本而重要的问题，同时也是自动机理论，多值逻辑网络中必须解决的问题，此问题的解决依赖于定出多值逻辑函数集中的所有极大封闭集(准完备集) 。 |
